A characterization of unimodular orientations of simple graphs
نویسنده
چکیده
Let G be a simple graph, and consider an orientation of the edges of G. Where V is the vertex-set of G, let A = (A,, : u, w E V) be the integral antisymmetric (0, +_ 1)-matrix such that A,,, = 1 if and only if VW is an edge of G directed from u to w. The orientation of G is said to be unimodular if for every WC V the determinant of the submatrix (A,, : u, w E W) is 0 or 1. For example, it is known that circle graphs can be provided with unimodular orientations. For any vertex v and any subset of vertices W let E(D, W) be the number of edges leaving u and entering W less the number of edges entering u and leaving IV. The main result of this paper says that the orientation of G is unimodular if and only if for every subset of vertices W such that E(W, W) is even for every w E W, we can reverse the orientations of the edges which belong to some cocycle C so that (E(u, W)( < 1 becomes true for every vertex. This generalizes a result of Ghouila-Houri for totally unimodular matrices.
منابع مشابه
Processes on Unimodular Random Networks
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning random walks, percolation, spanning forests, and amenability from the known context of unimodular quasi-transitive graphs to the more general context of unimodu...
متن کاملA characterization of the symmetric group of prime degree
Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$. Recently people have been using prime graphs to study simple groups. Naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? In this paper some results in this respect are obtained and as follows: $Gcong S_p$ if and only if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$, whe...
متن کاملWeakly transitive orientations, Hasse diagrams and string graphs
Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, Discrete Mathematics 111 (1993) 393-400. We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden substructurs. As a corollary of this characteriz...
متن کاملOn topological aspects of orientations
1. Introduction Constrained orientations, that is orientations such that all the vertices have a prescribed indegree, relates to one another many combinatorial and topological properties such as arboricity, connectivity and planarity. These orientations are the basic tool to solve planar augmentation problems 2]. We are concerned with two classes of planar graphs: maximal planar graphs (i.e. po...
متن کاملApproximate inference using unimodular graphs in dual decomposition
We use the property of unimodular functions to perform approximate inference with dual decomposition in binary labeled graphs. Exact inference is possible for a subclass of binary labeled graphs that have unimodular functions. We call such graphs unimodular graphs. These are graphs where the submodular and nonsubmodular edges follow a specific pattern– essentially that an isomorphism or ”flippi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 56 شماره
صفحات -
تاریخ انتشار 1992